IRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES Large Deviations Analysis of Variable-Rate Slepian-Wolf Coding
نویسندگان
چکیده
We analyze the asymptotic performance of ensembles of random binning Slepian-Wolf codes, where each type class of the source might have a different coding rate. In particular, we first provide the exact encoder excess rate exponent as well as the decoder error exponent. Then, using the error exponent expression, we determine the optimal rate function, namely, the minimal rate for each type class needed to satisfy a given requirement on the decoder error exponent. The resulting excess rate exponent is then evaluated for the optimal rate function. Alternating minimization algorithms are provided for the calculation of both the optimal rate function and the excess rate exponent. It is thus exemplified that, compared to fixed-rate coding, larger error exponents may be achieved using variable-rate coding, at the price of a finite excess rate exponent.
منابع مشابه
IRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES Erasure/List Exponents for Slepian-Wolf Decoding
متن کامل
IRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES Subset-sum phase transitions and data compression
We propose a rigorous analysis approach for the subset sum problem in the context of lossless data compression, where the phase transition of the subset sum problem is directly related to the passage between ambiguous and non–ambiguous decompression, for a compression scheme that is based on specifying the sequence composition. The proposed analysis lends itself to straightforward extensions in...
متن کاملIRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES Statistical Physics of Random Binning
We consider the model of random binning and finite–temperature decoding for Slepian–Wolf codes, from a statistical–mechanical perspective. While ordinary random channel coding is intimately related to the random energy model (REM) – a statistical–mechanical model of disordered magnetic materials, it turns out that random binning (for Slepian–Wolf coding) is analogous to another, related statist...
متن کاملIRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES Universal Decoding for Source–Channel Coding with Side Information
We consider a setting of Slepian–Wolf coding, where the random bin of the source vector undergoes channel coding, and then decoded at the receiver, based on additional side information, correlated to the source. For a given distribution of the randomly selected channel codewords, we propose a universal decoder that depends on the statistics of neither the correlated sources nor the channel, ass...
متن کاملIRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES Structure Theorems for Real- Time Variable Rate Coding With and Without Side Information
The output of a discrete Markov source is to be encoded instantaneously by a variable–rate encoder and decoded by a finite–state decoder. Our performance measure is a linear combination of the distortion and the instantaneous rate. Structure theorems, pertaining to the encoder and next–state functions are derived for every given finite–state decoder, which can have access to side information.
متن کامل